Computational geometry as a tool for studying root-finding methods
نویسندگان
چکیده
منابع مشابه
Accelerated Root Finding for Computational Finance
A parallel implementation of root finding on an SIMD application accelerator is reported. These are roots of stochastic differential equations in the computational finance domain which require a stochastic simulation to be performed for each evaluation of the pricing function. Experiments show that a speedup of 15X can be achieved over using a stand-alone CPU processor, depending on the require...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملWing geometry as a tool for studying the Lutzomyia longipalpis (Diptera: Psychodidae) complex.
Toro Toro (T) and Yungas (Y) have been described as genetically well differentiated populations of the Lutzomyia longipalpis (Lutz & Neiva, 1912) complex in Bolivia. Here we use geometric morphometrics to compare samples from these populations and new populations (Bolivia and Nicaragua), representing distant geographical origins, qualitative morphological variation ("one-spot" or "two-spots" ph...
متن کاملA Family of Root Finding Methods*
A one parameter family of iteration functions for finding roots is derived. ] h e family includes the Laguerre, Halley, Ostrowski and Euler methods and, as a limiting case, Newton's method. All the methods of the family are cubically convergent for a simple root (except Newton's which is quadratically convergent). The superior behavior of Laguerre's method, when starting from a point z for whic...
متن کاملFinding Shortest Paths With Computational Geometry
We present a heuristic search algorithm for the R Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought to be prohibitively expensive (at least quadratic time complexity); our algorithm runs in O(n log n) time and O(n logd−1 n) space, where n is the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1904019p